Discrete laplace operators: no free lunch

نویسندگان

  • Max Wardetzky
  • Saurabh Mathur
  • Felix Kälberer
  • Eitan Grinspun
چکیده

Discrete Laplace operators are ubiquitous in applications spanning geometric modeling to simulation. For robustness and efficiency, many applications require discrete operators that retain key structural properties inherent to the continuous setting. Building on the smooth setting, we present a set of natural properties for discrete Laplace operators for triangular surface meshes. We prove an important theoretical limitation: discrete Laplacians cannot satisfy all natural properties; retroactively, this explains the diversity of existing discrete Laplace operators. Finally, we present a family of operators that includes and extends well-known and widely-used operators.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Laplace-Beltrami operators and their convergence

The convergence property of the discrete Laplace–Beltrami operators is the foundation of convergence analysis of the numerical simulation process of some geometric partial differential equations which involve the operator. In this paper we propose several simple discretization schemes of Laplace–Beltrami operators over triangulated surfaces. Convergence results for these discrete Laplace–Beltra...

متن کامل

Convergent discrete Laplace-Beltrami operators over surfaces

The convergence problem of the Laplace-Beltrami operators plays an essential role in the convergence analysis of the numerical simulations of some important geometric partial differential equations which involve the operator. In this note we present a new effective and convergent algorithm to compute discrete Laplace-Beltrami operators acting on functions over surfaces. We prove a convergence t...

متن کامل

No-Free-Lunch theorems in the continuum

No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions. This fact was precisely formulated for the first time in a now famous paper by Wolpert and Macready, and then subsequently refined and extended by several authors, always in the context of a set of functions with discrete domain and codom...

متن کامل

The No Free Lunch Theorem Disproved by Counterexample: A Justification for Regrouing

After deriving the particle swarm equations from basic physics, this paper shows by contradiction that NFL Theorem 1, and consequently Theorems 2 and 3, are irrelevant to continuous optimization. As the discrete nature of matter at its most fundamental level is generally irrelevant from the broader classical perspective, so to is the discrete nature of an optimization problem at its most fundam...

متن کامل

On approximation of the Laplace-Beltrami operator and the Willmore energy of surfaces

Discrete Laplace–Beltrami operators on polyhedral surfaces play an important role for various applications in geometry processing and related areas like physical simulation or computer graphics. While discretizations of the weak Laplace–Beltrami operator are well-studied, less is known about the strong form. We present a principle for constructing strongly consistent discrete Laplace–Beltrami o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007